Compilation and Approximation of ConjunctiveQueries
نویسنده
چکیده
In this paper, we characterize the logical correspondence between conjunctive queries and concept descriptions. We exhibit a necessary and suucient condition for the compilation of a conjunctive query into an equivalent ALE concept description. We provide a necessary and suucient condition for the approximation of conjunctive queries by maximally subsumed ALN concept descriptions.
منابع مشابه
Approximation Techniques for Space-Efficient Compilation in Abductive Inference
We address the problem of approximately compiling propositional abduction problems (PAPs). We show intractability of compiling a PAP into a fixed-size representation, and of compiling a PAP to within a factor 2 > 0 of the compilation of minimal size. Although generating an approximate compilation is intractable in general, we describe a preference-based PAP for which order-of-magnitude smaller ...
متن کاملA Survey on Knowledge Compilation
Knowledge compilation is an AI technique for addressing computationally demanding reasoning problems. In this paper we survey recent results in knowledge compilation of propositional knowledge bases. We first define and limit the scope of such a technique, then we survey exact and approximate knowledge compilation methods. We include a discussion of compilation for non-monotonic knowledge bases.
متن کاملCompilation and Approximation of Conjunctive Queries by Concept Descriptions
In this paper, we characterize the logical correspondence between conjunctive queries and concept descriptions. We exhibit a necessary and sufficient condition for the compilation of a conjunctive query into an equivalent ALE concept description. We provide a necessary and sufficient condition for the approximation of conjunctive queries by maximally subsumed ALN concept descriptions.
متن کاملPanel on \ Knowledge Compilation and Approximation " : Terminology , Questions
It is well known that problems in Logic, Automated Deduction and Artiicial Intelligence are very much demanding from the computational point of view. Two of the techniques that have been proposed for addressing such computational diiculties are Knowledge Compilation and Knowledge Approximation. The central idea of the former technique is to split the goal of answering to the question whether a ...
متن کاملEfficient Query Answering Through Approximation
In this poster, we propose to recast the idea of knowledge compilation into approximating OWL DL ontologies with DL-Lite ontologies, against which query answering has only polynomial data complexity. We identify a useful category of queries for which our approach also guarantees completeness. Furthermore, we paper report on the implementation of our approach in the ONTOSEARCH2 system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002